Equivalences on Petri nets
نویسنده
چکیده
In this paper a set of Petri net equivalences is proposed. A correlation between all introduced equivalences is established, and a lattice of implications is obtained. In addition equivalences are examined on sequential nets. The process equivalences are demonstrated to be well discerning on this net class.
منابع مشابه
τ-Equivalences for analysis of concurrent systems modelled by Petri nets with silent transitions
The paper is devoted to the investigation of behavioural equivalences for Petri nets with silent transitions (τ -equivalences). Basic τ -equivalences and back-forth τ -bisimulation equivalences are supplemented by new ones, giving rise to the complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations are examined for the ge...
متن کاملBack-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the whole class of Petri nets as well as for their subclass of sequential nets. In addition, the preservation of ...
متن کاملTime Process Equivalences for Time Petri Nets
In the core of every theory of systems lies a notion of equivalence between systems: it indicates which particular aspects of systems behaviors are considered to be observable. In concurrency theory, a variety of observational equivalences has been promoted, and the relationships between them have been quite wellunderstood. In order to investigate the performance of systems (e.g. the maximal ti...
متن کاملPlace Bisimulation Equivalences for Design of Concurrent Systems
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and their preservation by refinements is investigated to find out which of these relations may be used in top-down design. It is demonstrated that the place bisimulation equivalences may...
متن کاملExploiting stochastic process algebra achievements for generalized stochastic Petri nets
Constructing large Generalized Stochastic Petri Nets (GSPN) by hierarchical composition of smaller components is a promising way to cope with the complexity of the design process for models of real hardware and software systems. The composition of nets is inspired by process algebraic operators. A solid theoretical framework of such operators relies on equivalences that are substitutive with re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003